An Improved Assignment Algorithm Based Rotational Angular Sorting Methods

نویسندگان

  • QIANG HUA
  • BIN WU
  • LIANG CHEN
چکیده

The data assignment problem occurs for multiple targets tracking application. It is crucial for the overall performance. In this paper, two observations of date assignment are considered, and then a new rotational sorting algorithm based on maximum likelihood principle was presented. The given algorithm of O(logN) and O(N) complexity developed is faster than the more popularly used Hungarian type O(N) algorithm. Key-Words: Data assignment problem; Hungarian algorithm; maximum likelihood principle

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Placement and Sizing of Distributed Generation Via an Improved Nondominated Sorting Genetic Algorithm II

The use of distributed generation units in distribution networks has attracted the attention of network managers due to its great benefits. In this research, the location and determination of the capacity of distributed generation (DG) units for different purposes has been studied simultaneously. The multi-objective functions in the optimization model are reducing system line losses; reducing v...

متن کامل

Pii: S0378-4754(01)00293-2

We have proved a new rotational sorting algorithm capable of reducing the complexity of data assignment process embedded in the maximum likelihood (ML)-based solution of a multitarget tracking problem from O(N3) of the conventional Hungarian type routines to O(N2) provided that the bearings-only measurements from an array of passive sensors are free from cluttering and missing data. © 2001 IMAC...

متن کامل

A new trust-region algorithm based on radial basis function interpolation

Optimization using radial basis functions as an interpolation tool in trust-region (ORBIT), is a derivative-free framework based on fully linear models to solve unconstrained local optimization, especially when the function evaluations are computationally expensive. This algorithm stores the interpolation points and function values to using at subsequent iterations. Despite the comparatively ad...

متن کامل

An Improved Hybrid Model with Automated Lag Selection to Forecast Stock Market

Objective: In general, financial time series such as stock indexes have nonlinear, mutable and noisy behavior. Structural and statistical models and machine learning-based models are often unable to accurately predict series with such a behavior. Accordingly, the aim of the present study is to present a new hybrid model using the advantages of the GMDH method and Non-dominated Sorting Genetic A...

متن کامل

A method for identifying software components based on Non-dominated Sorting Genetic Algorithm

Identifying the appropriate software components in the software design phase is a vital task in the field of software engineering and is considered as an important way to increase the software maintenance capability. Nowadays, many methods for identifying components such as graph partitioning and clustering are presented, but most of these methods are based on expert opinion and have poor accur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007